Biconjugate residual algorithm for solving general Sylvester-transpose matrix equations
نویسندگان
چکیده
منابع مشابه
An accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations
In this paper, an accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations is proposed. The convergence analysis of the algorithm is investigated. We show that the proposed algorithm converges to the exact solution for any initial value under certain assumptions. Finally, some numerical examples are given to demons...
متن کاملGradient Based Iterative Algorithm for Solving the Generalized Coupled Sylvester-transpose and Conjugate Matrix Equations over Reflexive (anti-reflexive) Matrices
Linear matrix equations play an important role in many areas, such as control theory, system theory, stability theory and some other fields of pure and applied mathematics. In the present paper, we consider the generalized coupled Sylvestertranspose and conjugate matrix equations Tν(X) = Fν , ν = 1, 2, . . . , N, where X = (X1, X2, . . . , Xp) is a group of unknown matrices and for ν = 1, 2, . ...
متن کاملPreconditioned Galerkin and minimal residual methods for solving Sylvester equations
This paper presents preconditioned Galerkin and minimal residual algorithms for the solution of Sylvester equations AX XB = C. Given two good preconditioner matricesM and N for matrices A and B, respectively, we solve the Sylvester equations MAXN MXBN =MCN. The algorithms use the Arnoldi process to generate orthonormal bases of certain Krylov subspaces and simultaneously reduce the order of Syl...
متن کاملA matrix LSQR algorithm for solving constrained linear operator equations
In this work, an iterative method based on a matrix form of LSQR algorithm is constructed for solving the linear operator equation $mathcal{A}(X)=B$ and the minimum Frobenius norm residual problem $||mathcal{A}(X)-B||_F$ where $Xin mathcal{S}:={Xin textsf{R}^{ntimes n}~|~X=mathcal{G}(X)}$, $mathcal{F}$ is the linear operator from $textsf{R}^{ntimes n}$ onto $textsf{R}^{rtimes s}$, $ma...
متن کاملA numerical algorithm for solving a class of matrix equations
In this paper, we present a numerical algorithm for solving matrix equations $(A otimes B)X = F$ by extending the well-known Gaussian elimination for $Ax = b$. The proposed algorithm has a high computational efficiency. Two numerical examples are provided to show the effectiveness of the proposed algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2018
ISSN: 0354-5180,2406-0933
DOI: 10.2298/fil1815307h